Efficient Adaptive Test Method for Textile Development Length in TRC
نویسندگان
چکیده
منابع مشابه
adaptive mobile localization in residual test method
determination of mobile localization with time of arrival (toa) signal is a requirement in cellular mobile communication. in some of the previous methods, localization with non-line-of-sight (nlos) paths can lead to large position error. also for simplicity, in most simulations suppose non stationary actual environments as stationary. this paper proposes (residual test + recursive least square)...
متن کاملDevelopment of an Efficient Hybrid Method for Motif Discovery in DNA Sequences
This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...
متن کاملA Power Efficient Test Data Compression Method for SoC using Alternating Statistical Run-Length Coding
A power efficient System-on-a-Chip test data compressionmethod using alternating statistical run-length coding is proposed. To effectively reduce test power dissipation, the test set is firstly preprocessed by 2D reordering scheme. To further improve the compression ratio, 4 m partitioning of the runs and a smart filling of the don’t care bits provide the nice results, and alternating statistic...
متن کاملAn Efficient Method for Compressing Test Data
The overall throughput of automatic test equipment (ATE) is sensitive to the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. A compression algorithm for test data should meet two requirements: lossless and simple decompression. In this paper, we propose a new test data compression method that aims to fully uti...
متن کاملEfficient VLSI Architecture for Variable Length Block LMS Adaptive Filter
In this paper, we made an analysis on computational complexity of block least mean square (BLMS) finite impulse response (FIR) filter and decompose the filter computation into M sub-filters, where M = N/L, N is the filter length and L is the block-size. Each sub-filter acts like a short-length BLMS FIR filter of size L. The proposed decomposition scheme favors timemultiplexing the filtering com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Civil Engineering
سال: 2018
ISSN: 1687-8086,1687-8094
DOI: 10.1155/2018/4650102